Survey of Metaheuristic Algorithms for Combinatorial Optimization
نویسندگان
چکیده
منابع مشابه
Parameter Meta-optimization of Metaheuristic Optimization Algorithms
Erklärung Hiermit erkläre ich an Eides statt, dass ich die vorliegende Arbeit selbstständig und ohne fremde Hilfe verfasst, andere als die angegebenen Quellen und Hilfsmit-tel nicht benutzt und die aus anderen Quellen entnommenen Stellen als solche gekennzeichnet habe. Abstract 1 Kurzfassung 2 1 Introduction 3 1.
متن کاملPhysics Based Metaheuristic Algorithms for Global Optimization
In recent years, several optimization methods especially metaheuristic optimization methods have been developed by scientists. People have utilized power of nature to solve problems. Therefore, those metaheuristic methods have imitated physical and biological processes of nature. In 2007, Big Bang Big Crunch optimization algorithm based on evolution of universe and in 2009, Gravitational Search...
متن کاملInvestigation on Novel Based Metaheuristic Algorithms for Combinatorial Optimization Problems in Ad Hoc Networks
Routing in MANET is extremely challenging because of MANETs dynamic features, its limited bandwidth, frequent topology changes caused by node mobility and power energy consumption. In order to efficiently transmit data to destinations, the applicable routing algorithms must be implemented in mobile ad-hoc networks. Thus we can increase the efficiency of the routing by satisfying the Quality of ...
متن کاملA Deterministic Metaheuristic Approach Using "Logistic Ants" for Combinatorial Optimization
Ant algorithms are usually derived from a stochastic modeling based on some specific probability laws. We consider in this paper a full deterministic model of “logistic ants” which uses chaotic maps to govern the behavior of the artificial ants. We illustrate and test this approach on a TSP instance, and compare the results with the original Ant System algorithm. This change of paradigm —determ...
متن کاملApproximation Algorithms for Combinatorial Optimization
In combinatorial optimization, the most important challenges are presented by problems belonging to the class NP-hard. For such problems no algorithm is known that can solve all instances in polynomial time. It is also strongly believed that no polynomial algorithm is capable of doing this. Although it is very difficult to solve exactly any of the NP-hard problems, some of them are amenable to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2012
ISSN: 0975-8887
DOI: 10.5120/9391-3813